In this paper we analyze the (im)possibility of the exact distinguishabilityof orthogonal multipartite entangled states under {\em restricted localoperation and classical communication}. Based on this local distinguishabilityanalysis we propose a new scheme for quantum secret sharing (QSS). Our QSSscheme is quite general and cost efficient compared to other schemes. In ourscheme no joint quantum operation is needed to reconstruct the secret. We alsopresent an interesting $(2,n)$-threshold QSS scheme, where any two cooperatingplayers, one from each of two disjoint groups of players, can alwaysreconstruct the secret. This QSS scheme is quite uncommon, as most$(k,n)$-threshold schemes have the restriction $k\geq\lceil\frac{n}{2}\rceil$.
展开▼
